Indeed : Interactive Deduction on Horn Clause Theories
نویسندگان
چکیده
We introduce the declarative programming language Indeed that uses both deduction and interaction through multi-agent system applications. The language design is addressed by providing a uniform programming model that combines two refinements of resolution along with some control strategies to introduce state-based descriptions. We show that the logical calculus in which the computational model is based is sound and complete. Finally, we compare our approach to others proposed for coupling interaction with automated deduction.
منابع مشابه
Equality and Abductive Residua for Horn Clauses
One method of proving theorems in Horn clause theories is surface deduction (also known as the modiication method). Surface deduction yields interpretations of uniication failures in terms of residual hypotheses needed for uniication to succeed. This suggests that it can be used for abductive reasoning with equality. In surface deduction the input clauses are rst transformed to a at form (invol...
متن کاملTowards First-order Deduction Based on Shannon Graphs
We present a new approach to Automated Deduction based on the concept of Shan-non graphs, which are also known as Binary Decision Diagrams (BDDs). A Skolemized formula is rst transformed into a Shannon graph, then the latter is compiled into a set of Horn clauses. These can nally be run as a Prolog program trying to refute the initial formula. It is also possible to precompile axiomatizations i...
متن کاملGeneralized Horn Clause Programs
This paper considers, in a general setting, an axiomatic basis for Horn clause logic programming. It characterizes a variety of \Horn-clause-like" computations, arising in contexts such as deductive databases, various abstract interpretations, and extensions to logic programming involving E-uniication, quantitative deduction, and inheritance, in terms of two simple operators , and discusses alg...
متن کاملDeciding H1 by resolution
Nielson, Nielson and Seidl’s class H1 is a decidable class of first-order Horn clause sets, describing strongly regular relations. We give another proof of decidability, and of the regularity of the defined languages, based on fairly standard automated deduction techniques.
متن کاملInjectivity of Composite Functions
The problem of deciding injectivity of functions is addressed. The functions under consideration are compositions of more basic functions for which information about injectivity properties is available. We present an algorithm which will often be able to prove that such a composite function is injective. This algorithm constructs a set of propositional Horn clause axioms from the function speci...
متن کامل